de Finetti reductions for partially exchangeable probability distributions
نویسندگان
چکیده
We introduce a general framework for de Finetti reduction results, applicable to various notions of partially exchangeable probability distributions. Explicit statements are derived for the cases of exchangeability, Markov exchangeability, and some generalizations of these. Our techniques are combinatorial and rely on the “BEST” theorem, enumerating the Eulerian cycles of a multigraph.
منابع مشابه
Unknown Quantum States: The Quantum de Finetti Representation
We present an elementary proof of the quantum de Finetti representation theorem, a quantum analogue of de Finetti’s classical theorem on exchangeable probability assignments. This contrasts with the original proof of Hudson and Moody [Z. Wahrschein. verw. Geb. 33, 343 (1976)], which relies on advanced mathematics and does not share the same potential for generalization. The classical de Finetti...
متن کاملPrediction rules for exchangeable sequences related to species sampling
Suppose an exchangable sequence with values in a nice measurable space S admits a prediction rule of the following form: given the rst n terms of the sequence, the next term equals the jth distinct value observed so far with probability pj;n, for j = 1; 2; : : :, and otherwise is a new value with distribution for some probability measure on S with no atoms. Then the pj;n depend only on the part...
متن کاملPrediction rules for exchangeable sequencesrelated to species sampling 1
Suppose an exchangable sequence with values in a nice measurable space S admits a prediction rule of the following form: given the rst n terms of the sequence, the next term equals the jth distinct value observed so far with probability pj;n, for j = 1; 2; : : :, and otherwise is a new value with distribution for some probability measure on S with no atoms. Then the pj;n depend only on the part...
متن کاملFlexible constrained de Finetti reductions and applications
De Finetti theorems show how sufficiently exchangeable states are well-approximated by convex combinations of i.i.d. states. Recently, it was shown that in many quantum information applications a more relaxed de Finetti reduction (i.e. only a matrix inequality between the symmetric state and one of de Finetti form) is enough, and that it leads to more concise and elegant arguments. Here we show...
متن کاملA simple proof of Renner’s exponential de Finetti theorem
In quantum information theory a de Finetti theorem expresses the fact that a quantum state ρ ∈ (Cd)⊗n that is invariant under permutation of its n subsystems is close to a mixture of tensor product states. The first such result is due to de Finetti [3], who showed that any classical distribution that is infinitely exchangeable can be expressed as a convex combination of product distributions. M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1801.05240 شماره
صفحات -
تاریخ انتشار 2018